A tensor based hyper-heuristic for nurse rostering
نویسندگان
چکیده
منابع مشابه
A tensor based hyper-heuristic for nurse rostering
Nurse rostering is a well-known highly constrained scheduling problem requiring assignment of shifts to nurses satisfying a variety of constraints. Exact algorithms may fail to produce high quality solutions, hence (meta)heuristics are commonly preferred as solution methods which are often designed and tuned for specific (group of) problem instances. Hyper-heuristics have emerged as general sea...
متن کاملA Tensor-based Approach to Nurse Rostering
Hyper-heuristics are high level improvement search methodologies exploring space of heuristics [4]. According to [5], hyper-heuristics can be categorized in many ways. A hyper-heuristic either selects from a set of available low level heuristics or generates new heuristics from components of existing low level heuristics to solve a problem, leading to a distinction between selection and generat...
متن کاملA Hyper-Heuristic Using GRASP with Path-Relinking: A Case Study of the Nurse Rostering Problem
The goal of hyper-heuristics is to design and choose heuristics to solve complex problems. The primary motivation behind the hyper-heuristics is to generalize the solving ability of the heuristics. In this paper, the authors propose a Hyper-heuristic using GRASP with Path-Relinking (HyGrasPr). HyGrasPr generates heuristic sequences to produce solutions within an iterative procedure. The procedu...
متن کاملSecurity personnel routing and rostering: a hyper- heuristic approach
In the present study, a large scale, structured problem regarding the routing and rostering of security personnel is investigated. Structured problems are combinatorial optimization problems that encompass characteristics of more than one known problem in operational research. The problem deals with assigning the available personnel to visits associated with a set of customers. This objective j...
متن کاملA tensor-based selection hyper-heuristic for cross-domain heuristic search
Hyper-heuristics have emerged as automated high level search methodologies that manage a set of low level heuristics for solving computationally hard problems. A generic selection hyper-heuristic combines heuristic selection and move acceptance methods under an iterative single point-based search framework. At each step, the solution in hand is modified after applying a selected heuristic and a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge-Based Systems
سال: 2016
ISSN: 0950-7051
DOI: 10.1016/j.knosys.2016.01.031